On the Placement Delivery Array Design for Coded Caching Scheme in D2D Networks
نویسندگان
چکیده
The coded caching scheme is an efficient technique as a solution to reduce the wireless network burden during the peak timesin a Device-to-Device (D2D in short) communications. In a coded caching scheme, each file block should be divided into Fpackets. It is meaningful to design a coded caching scheme with the rate and F as small as possible, especially in the practice forD2D network. In this paper we first characterize coded caching scheme for D2D network by a simple array called D2D placementdelivery array (DPDA in shot). Consequently some coded caching scheme for D2D network can be discussed by means of anappropriate DPDA. Secondly we derive the lower bounds on the rate and F of a DPDA. According these two lower bounds, weshow that the previously known determined scheme proposed by Ji et al., ( IEEE Trans. Inform. Theory, 62(2): 849-869,2016)reaches our lower bound on the rate, but does not meet the lower bound on F for some parameters. Finally for these parameters,we construct three classes of DPDAs which meet our two lower bounds. Based on these DPDAs, three classes of coded cachingscheme with low rate and lower F are obtained for D2D network.
منابع مشابه
Towards Practical File Packetizations in Wireless Device-to-Device Caching Networks
We consider wireless device-to-device (D2D) caching networks with single-hop transmissions. Previous work has demonstrated that caching and coded multicasting can significantly increase per user throughput. However, the state-of-the-art coded caching schemes for D2D networks are generally impractical because content files are partitioned into an exponential number of packets with respect to the...
متن کاملOn the Coded Caching Delivery Design over Wireless Networks
Coded caching scheme is a promising technique to migrate the network burden in peak hours, which attains more prominent gains than the uncoded caching. The coded caching scheme can be classified into two types, namely, the centralized and the decentralized scheme, according to whether the placement procedures are carefully designed or operated at random. However, most of the previous analysis a...
متن کاملSome new bounds of placement delivery arrays
Coded caching scheme is a technique which reduce the load during peak traffic times in a wireless network system. Placement delivery array (PDA in short) was first introduced by Yan et al.. It can be used to design coded caching scheme. In this paper, we prove some lower bounds of PDA on the element and some lower bounds of PDA on the column. We also give some constructions for optimal PDA.
متن کاملPlacement Delivery Array Design for Combination Networks with Edge Caching
A major practical limitation of the Maddah-Ali-Niesen coded caching techniques is their high subpacketization level. For the simple network with a single server and multiple users, Yan et al. proposed an alternative scheme with the so-called placement delivery arrays (PDA). Such a scheme requires slightly higher transmission rates but significantly reduces the subpacketization level. In this pa...
متن کاملOn the Placement and Delivery Schemes for Decentralized Coded Caching System
Network based on distributed caching of content is a new architecture to alleviate the ongoing explosive demands for rate of multi-media traffic. In caching networks, coded caching is a recently proposed technique that achieves significant performance gains compared to uncoded caching schemes. In this paper, we derive a lower bound on the average rate with a memory constraint for a family of ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.06212 شماره
صفحات -
تاریخ انتشار 2017